Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
181	Theory of Computing Systems manuscript No. (will be inserted by the editor) Nash Equilibria and the Price of Anarchy for Flows Over Time Ronald Koch · Martin Skutella Add to Reading List Source URL: page.math.tu-berlin.de Language: English Network flow Flow network Operations research Price of anarchy Volumetric flow rate Shortest path problem Graph theory Mathematics Theoretical computer science
182	An FPTAS for Flows over Time with Aggregate Arc Capacities? Daniel Dressler and Martin Skutella Institute for Mathematics, TU Berlin, Str. des 17. Juni 136, 10623 Berlin, Germany, {dressler, skutella}@math.tu-berlin.de Add to Reading List Source URL: page.math.tu-berlin.de Language: English Piping Chemical engineering Combinatorics Continuum mechanics Flow network Physics Fluid dynamics Flow Maximum flow problem Network flow Aerodynamics Mathematics
183	Algorithmica[removed]: 323–342 DOI[removed]s00453[removed]Computing Minimum Cuts by Randomized Search Heuristics Frank Neumann · Joachim Reichel · Add to Reading List Source URL: page.math.tu-berlin.de Language: English Combinatorial optimization Operations research Network flow NP-complete problems Minimum cut Maximum flow problem Flow network Cut Maximum cut Graph theory Mathematics Theoretical computer science
184	Structure and Dynamics of Information Pathways in Online Media Manuel Gomez-Rodriguez MPI for Intelligent Systems Stanford University Add to Reading List Source URL: cs.stanford.edu Language: English - Date: 2012-12-04 18:43:11 Theoretical computer science Networks Network analysis Algebraic graph theory Social networks Complex contagion Flow network Centrality Shortest path problem Graph theory Mathematics Network theory
185	PDF Document Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2013-10-24 09:46:06 Graph Centrality Flow network Random graph Shortest path problem Line graph Adjacency matrix Power graph analysis Covering graph Graph theory Mathematics Theoretical computer science
186	JN[removed]Flow in transport networks 2 3 Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2006-05-18 12:16:21 Combinatorics Maximum flow problem Flow network Max-flow min-cut theorem Cut Ford–Fulkerson algorithm Push-relabel maximum flow algorithm Network flow Graph theory Mathematics
187	Frank G. Madsen Queens’ College University of Cambridge International Monetary Flows of Non-Declared Origin Add to Reading List Source URL: parrochia.wifeo.com Language: English - Date: 2011-05-16 09:39:28 Electrical engineering Mathematics Flow network Operations research Electronics Electrical network Maximum flow problem Gustav Kirchhoff Traffic flow Network flow Electromagnetism Electronic engineering
188	340 Chapter 10 Mining Social-Network Graphs Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2014-05-27 13:40:22 Networks Network analysis Algebraic graph theory Girvan–Newman algorithm Graph Flow network Shortest path problem Breadth-first search Bipartite graph Graph theory Mathematics Network theory
189	ACADEMIA DE TRANSPORTURI, Add to Reading List Source URL: www.aticmd.md Language: English - Date: 2012-03-29 13:16:44 Mathematics Applied mathematics Mathematical sciences Network flow Flow network Minimum-cost flow problem
190	2013 IEEE 54th Annual Symposium on Foundations of Computer Science A forward-backward single-source shortest paths algorithm Uri Zwick Tel Aviv University [removed] Add to Reading List Source URL: dbwilson.com Language: English - Date: 2013-12-01 03:48:54 Routing algorithms Combinatorial optimization Network flow Network theory Shortest path problem Distance Graph Matching Floyd–Warshall algorithm Mathematics Graph theory Theoretical computer science

UPDATE